/*
ID:luongho3
TASK:zerosum
LANG:C++
*/
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
#define MAXN 9
#define PLUS 2
#define MINUS 1
#define SPACE 0
ifstream fin("zerosum.in");
ofstream fout("zerosum.out");
int N;
int arr[MAXN*2];
int reduce[MAXN*2];
int p3[10] = {1,3,9,27,81,243,729,2187,6561,19683};
string strs[10000];
int nstr = 0;
int main() {
    fin >> N;
    int i,j,idx,k,sum;
    for (i=0;i<N;++i) {
        arr[i*2] = i+1;
        arr[i*2+1] = 0;
    }
    
    for (i=0;i<p3[N-1];++i) {
        
        idx = 1;
        k = i;
        while (k>0) {
              arr[idx] = k%3;
              idx = idx + 2;
              k /= 3;
        }
        idx = 0;
        for (j=0;j<2*N-1;++j) {
            if (j%2==0) {
               reduce[idx] = arr[j];
               idx++;
            }
            else {
                 if (arr[j]==PLUS || arr[j]==MINUS) {
                    reduce[idx] = arr[j];
                    idx++;
                 }
                 else {
                      reduce[idx-1] = reduce[idx-1]*10 + arr[j+1];
                      j = j + 1;
                 }
            }
        }
        sum = reduce[0];
        for (k=1;k<idx;k=k+2) {
            if (reduce[k]==PLUS) {
               sum = sum + reduce[k+1];
            }
            else {
                 sum = sum - reduce[k+1];
            }
        }
        if (sum == 0) {
           string s = "";
           for (k=0;k<2*N-1;++k) {
               if (k%2==0) {
                  //fout << arr[k];
                  s += (arr[k]+'0');
               }
               else {
                    if (arr[k]==PLUS) {
                       s += "+";
                    }
                    else if (arr[k]==MINUS) {
                         s += "-";
                    }
                    else {
                         s += " ";
                    }
               }
           }
           strs[nstr] = s;
           nstr++;
        }
    }
    sort(strs,strs+nstr);
    for (i=0;i<nstr;++i) {
        fout << strs[i] << "\n";
    }
    return 0;
}
